Intuitionistic Logic Programming for SQL (Extended Abstract)

نویسنده

  • Fernando Sáenz-Pérez
چکیده

Intuitionistic logic programming provides the notion of embedded implication in rule bodies, which can be used to reason about a current database modified by the antecedent. This can be applied to a system that translates SQL to Datalog to solve SQL WITH queries, for which relations are locally defined and can therefore be understood as added to the current database. In addition, assumptions in SQL queries as either adding or removing data can be modelled in this way as well, which is an interesting feature for decision-support scenarios. This work suggests a way to apply intuitionistic logic programming to SQL, and provides a pointer to a working system implementing this idea.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic Programming In A Fragment Of Intuitionistic Linear Logic: Extended Abstract

Logic programming languages based on fragments of intuitionistic logic have recently been developed and studied by several researchers. In such languages, implications are permitted in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G in a context τ leads to an attempt to prove the goal G in the extended context τ ∪{D}. While an intuitionistic notion of context ha...

متن کامل

A Proof Theory for Generic Judgments: An extended abstract

A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of the sequent) and to each formula in the sequent (used to account for generic variables locally scoped over the form...

متن کامل

Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract)

We present the design philosophy of a proof checker based on a notion of foundational proof certificates. At the heart of this design is a semantics of proof evidence that arises from recent advances in the theory of proofs for classical and intuitionistic logic. That semantics is then performed by a (higher-order) logic program: successful performance means that a formal proof of a theorem has...

متن کامل

A Data Envelopment Analysis Model with Triangular Intuitionistic Fuzzy Numbers

DEA (Data Envelopment Analysis) is a technique for evaluating the relative effectiveness of decision-making units (DMU) with multiple inputs and outputs data based on non-parametric modeling using mathematical programming (including linear programming, multi-parameter programming, stochastic programming, etc.). The classical DEA methods are developed to handle the information in the form of cri...

متن کامل

Games on Graphs and Sequentially Realizable Functionals Extended Abstract

We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic setting for sequential algorithms. However, we show that with a natural exponential we obtain a mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1608.03535  شماره 

صفحات  -

تاریخ انتشار 2016